/*******************************************************************************
 * Developer: Ian Doyle
 * Date:      6/23/2012
 *
 * All code Copyright (C) 2012 Ian Doyle. All rights reserved.
 *
 * This file is a part of FileFocus.
 *
 * FileFocus is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * FileFocus is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with FileFocus.  If not, see <http://www.gnu.org/licenses/>.
 ******************************************************************************/


package filefocus;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.security.NoSuchAlgorithmException;
import java.util.Collection;
import java.util.TreeMap;
import filefocus.exception.FailedExecutionException;
import filefocus.exception.UnreadableFileException;


public class FileDigestMap extends
		TreeMap<ComparableDigest, FileList> implements FileOrganizationTreeBranch {
	
	/**
	 * 
	 */
	private static final long serialVersionUID = 881724944521600123L;
	
	private FileDigester digester;
	private int numFiles;
	
	public FileDigestMap(FileType fType) throws NoSuchAlgorithmException 
	{
		digester = FileFocusProcessors.fileDigester(fType);
		numFiles = 0;
	}

	public void addFile(File file) throws FileNotFoundException, IOException, UnreadableFileException, FailedExecutionException, InterruptedException
	{
		ComparableDigest digest = new ComparableDigest(digester.digestFile(file));
		FileList matchingFiles = get(digest);
		if(matchingFiles != null)
		{
			matchingFiles.addFile(file);
		}
		else
		{
			matchingFiles = new FileList();
			matchingFiles.addFile(file);
			put(digest, matchingFiles);
		}
		++numFiles;
	}

	@Override
	public int count() {
		return numFiles;
	}

	@Override
	public Collection<FileList> flatten() {
		return values();
	}
}
